Global Optimization for Bus Line Timetable Setting Problem
نویسندگان
چکیده
منابع مشابه
Local Bus Deregulation and Timetable Inability
In this paper we present a model of competition between operators on urban local bus routes in which passengers always board the first bus to arrive, and it is costly to revise timetables. The model predictds that timetables are unstable, the operator whose bus was boarded by fewest passengers is the most likely to change its arrival time, and to try to leapfrog its rival by arriving just befor...
متن کاملPassenger routing for periodic timetable optimization
The task of periodic timetabling is to schedule the trips in a public transport system by determining arrival and departure times at every station such that travel and transfer times are minimized. To date, the optimization literature generally assumes that passengers do not respond to changes in the timetable, i.e., the passenger routes are fixed. This is unrealistic and ignores potentially va...
متن کاملPerformance of Algorithms for Periodic Timetable Optimization
During the last 15 years, there have been proposed many solution methods for the important task of constructing periodic timetables for public transportation companies. We first point out the importance of an objective function, where we observe that in particular a linear objective function turns out to be a good compromise between essential practical requirements and computational tractabilit...
متن کاملGlobal Optimization for the Phase Stability Problem
The Gibbs tangent plane criterion has become an important tool in determining the quality of obtained solutions to the phase and chemical equilibrium problem. The ability to determine if a postulated solution is thermodynamically stable with respect to perturbations in any or all of the phases is very useful in the search for the true equilibrium solution. Previous approaches have concentrated ...
متن کاملGlobal Optimization for Satisfiability (SAT) Problem
The satisfiability (SAT) problem is a fundamental problem in mathematical logic, inference, automated reasoning, VLSI engineering, and computing theory. In this paper, following CNF and D N F local search methods, we introduce the Universal SAT problem model, UniSAT, which transforms the discrete SAT problem on Boolean space (0, l}"' into an unconstrained global optimization problem on real spa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2014
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2014/636937